Communication complexity tools on recognizable picture languages
نویسندگان
چکیده
منابع مشابه
On Some Recognizable Picture-Languages
We show that the language of pictures over fa; bg, where all occurring b's are connected is recognizable, which solves an open problem in Mat98]. We generalize the used construction to show that monocausal deterministically recognizable picture languages are recognizable, which is surprisingly nontrivial. Furthermore we show that the language of pictures over fa; bg, where the number of a's is ...
متن کاملOn the Complexity of Unary Tiling-Recognizable Picture Languages
We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary strings to represent unary pictures and we prove that any unary picture language L is in Rec1 if and only if the set of all quasi-unary strings encoding the elements of L is recognizable by a one-tape nondeterministic Turing m...
متن کاملDeterministically and Sudoku-Deterministically Recognizable Picture Languages
The recognizable 2-dimensional languages are a robust class with many characterizations, comparable to the regular languages in the 1-dimensional case. One characterization is by tiling systems. The corresponding word problem is NP-complete. Therefore, notions of determinism for tiling systems were suggested. For the notion which was called ”deterministically recognizable” it was open since 199...
متن کاملLocal and recognizable hexagonal picture languages
In this paper we introduce hexagonal Wang tiles, local hexagonal picture languages, and recognizable hexagonal picture languages. We use hexagonal Wang tiles to introduce hexagonal Wang systems(HWS), a formalism to recognize hexagonal picture languages. It is noticed that the family of hexagonal picture languages defined by hexagonal Wang systems coincides with the family of hexagonal picture l...
متن کاملRecognizable Picture Languages and Domino Tiling
In [2], Giammarresi and Restivo define the notion of local picture languages by giving a set of authorized 2 x 2 tiles over C U {#} where # is a boundary symbol which surrounds the pictures. Then they define the class of recognizable picture languages as the set of languages which can be obtained by projection of a local one. This class is of interest since it admits several quite different cha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.05.040